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 listMay 22, 2025 17:06vahookvahookScore: 4,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2025 17:064,71258,274,26236,098,0003,008,0002,527,232
2May 22, 2025 17:064,72665,129,80937,216,0002,011,0002,527,232
3May 22, 2025 17:064,74264,979,85236,328,0003,027,0002,531,328
4May 22, 2025 17:064,74666,581,44035,349,0004,039,0002,433,024
5May 22, 2025 17:064,76358,939,66634,467,0005,068,0002,437,120
6May 22, 2025 17:064,80166,372,38636,857,0002,988,0002,527,232