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 listOct 13, 2026 04:24e1011e1011Score: 412,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 04:27412,6143,435,466,8823,355,645,00069,055,0002,113,536
2Oct 13, 2026 04:27412,6563,435,899,6453,355,891,00069,162,0002,113,536
3Oct 13, 2026 04:27412,7023,436,702,2343,356,385,00069,047,0002,113,536
4Oct 13, 2026 04:27412,8733,437,447,1413,356,792,00070,061,0002,113,536
5Oct 13, 2026 04:27412,9453,438,006,2583,356,398,00071,048,0002,113,536
6Oct 13, 2026 04:27414,0403,447,645,7583,366,311,00070,225,0002,113,536
7Oct 13, 2026 04:27415,6553,461,529,2483,379,872,00070,070,0002,113,536
8Oct 13, 2026 04:27415,9483,467,700,9833,383,168,00069,207,0002,113,536
9Oct 13, 2026 04:27419,3213,491,670,0873,411,320,00069,052,0002,113,536