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 listJun 6, 2026 15:08merripiummerripiumScore: 71,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:1171,611603,592,695535,128,00059,247,0002,113,536
2Jun 6, 2026 15:1171,663604,007,416535,486,00059,320,0002,113,536
3Jun 6, 2026 15:1171,714606,728,124535,348,00059,884,0002,113,536
4Jun 6, 2026 15:1171,746604,694,786534,763,00060,733,0002,113,536
5Jun 6, 2026 15:1171,750604,669,408535,815,00059,712,0002,113,536
6Jun 6, 2026 15:1171,785604,993,477535,358,00060,460,0002,113,536
7Jun 6, 2026 15:1171,792605,107,886535,210,00060,665,0002,113,536
8Jun 6, 2026 15:1171,812605,180,784534,667,00061,377,0002,113,536
9Jun 6, 2026 15:1171,906606,013,163535,275,00061,548,0002,113,536