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 16, 2026 09:20Hung T.NguyenHung T.NguyenScore: 47,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 09:2047,783419,736,083334,661,00061,937,0002,392,064
2Mar 16, 2026 09:2047,958423,194,056334,046,00064,008,0002,457,600
3Mar 16, 2026 09:2047,972426,993,165334,138,00064,026,0002,273,280