Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 14, 2025 17:35NicoNicoScore: 122,480Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 17:35122,2681,042,604,077818,860,000195,966,0002,371,584
2Jul 14, 2025 17:35122,3321,040,884,701827,476,000187,881,0002,367,488
3Jul 14, 2025 17:35122,3611,041,085,942812,675,000202,918,0002,375,680
4Jul 14, 2025 17:35122,4241,046,792,599792,094,000224,026,0002,285,568
5Jul 14, 2025 17:35122,4801,042,139,033824,664,000191,921,0002,375,680
6Jul 14, 2025 17:35123,1731,048,566,740816,467,000205,865,0002,285,568
7Jul 14, 2025 17:35123,1741,048,479,361818,474,000203,869,0002,289,664
8Jul 14, 2025 17:35123,9121,050,413,848802,589,000225,884,0002,281,472
9Jul 14, 2025 17:35124,1871,056,217,434815,804,000214,948,0002,277,376