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 listMar 14, 2026 21:49wnwnScore: 4,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:534,24559,431,70733,221,0002,013,0002,273,280
2Mar 14, 2026 21:534,24652,411,78833,231,0002,014,0002,531,328
3Mar 14, 2026 21:494,25459,258,16334,302,0001,008,0002,498,560
4Mar 14, 2026 21:534,28258,250,62134,522,0001,015,0002,273,280
5Mar 14, 2026 21:534,29259,644,15834,606,0001,017,0002,498,560
6Mar 14, 2026 21:534,29764,640,36834,644,0001,018,0002,490,368
7Mar 14, 2026 21:494,31962,706,32533,855,0001,991,0002,498,560
8Mar 14, 2026 21:534,32558,706,17433,900,0001,994,0002,273,280
9Mar 14, 2026 21:494,33861,091,27834,009,0002,000,0002,273,280