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 listAug 17, 2026 19:37Navneet RajNavneet RajScore: 87,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 19:3986,952731,522,883662,544,00059,159,0002,113,536
2Aug 17, 2026 19:3986,952732,297,253663,031,00058,673,0002,113,536
3Aug 17, 2026 19:3986,990731,916,277663,172,00058,850,0002,113,536
4Aug 17, 2026 19:3987,011732,013,762663,503,00058,694,0002,113,536
5Aug 17, 2026 19:3987,025732,232,774663,285,00059,030,0002,113,536
6Aug 17, 2026 19:3987,027732,753,340663,694,00058,631,0002,113,536
7Aug 17, 2026 19:3987,030732,803,011663,471,00058,878,0002,113,536
8Aug 17, 2026 19:3987,068732,395,695663,613,00059,053,0002,113,536
9Aug 17, 2026 19:3987,071732,555,659663,795,00058,896,0002,113,536