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 24, 2026 04:52wnwnScore: 3,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:523,31036,349,80726,475,0001,002,0002,113,536
2Sep 24, 2026 04:523,32936,354,67626,606,0001,031,0002,113,536
3Sep 24, 2026 04:523,33036,453,28726,601,0001,038,0002,113,536
4Sep 24, 2026 04:523,33036,450,56226,607,0001,033,0002,113,536
5Sep 24, 2026 04:523,33936,457,78626,682,0001,032,0002,113,536
6Sep 24, 2026 04:523,35436,616,90126,831,0001,010,0002,113,536
7Sep 24, 2026 04:523,39336,780,20227,141,0001,023,0002,113,536
8Sep 24, 2026 04:523,46738,304,79927,742,0001,037,0002,113,536
9Sep 24, 2026 04:523,48938,396,78427,921,0001,041,0002,113,536