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 12, 2026 17:21caandocaandoScore: 7,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 17:216,99681,982,62645,051,00013,014,0002,359,296
2Mar 12, 2026 17:217,00081,611,76642,075,00016,028,0002,359,296
3Mar 12, 2026 17:217,00581,545,23845,113,00013,032,0002,351,104
4Mar 12, 2026 17:217,51488,489,61050,295,00012,070,0002,347,008
5Mar 12, 2026 17:217,56290,410,46850,809,00011,955,0002,359,296
6Mar 12, 2026 17:217,70395,237,34349,952,00013,986,0002,277,376