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 listApr 13, 2026 19:08Yuriy LyfenkoYuriy LyfenkoScore: 4,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 19:084,41764,355,58935,641,0001,018,0002,473,984
2Apr 13, 2026 19:084,43559,852,98935,817,000994,0002,473,984
3Apr 13, 2026 19:084,43863,859,01234,843,0001,991,0002,273,280
4Apr 13, 2026 19:084,44563,259,87535,900,000997,0002,473,984
5Apr 13, 2026 19:084,44664,615,77834,910,0001,994,0002,535,424
6Apr 13, 2026 19:084,45060,684,91934,935,0001,996,0002,473,984