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 listSep 29, 2026 05:04Karthik ReddyKarthik ReddyScore: 4,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 05:044,39846,751,20335,389,0001,117,0002,113,536
2Sep 29, 2026 05:044,40046,726,78135,405,0001,116,0002,113,536
3Sep 29, 2026 05:044,43547,263,74935,642,0001,175,0002,113,536
4Sep 29, 2026 05:044,43547,094,25635,689,0001,124,0002,113,536
5Sep 29, 2026 05:044,46247,334,77735,907,0001,132,0002,113,536
6Sep 29, 2026 05:044,47947,509,55136,007,0001,173,0002,113,536
7Sep 29, 2026 05:044,51547,783,66036,343,0001,134,0002,113,536
8Sep 29, 2026 05:044,57148,413,79036,811,0001,136,0002,113,536
9Sep 29, 2026 05:044,58648,326,46236,927,0001,141,0002,113,536