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 listMay 20, 2026 05:46M-RochatM-RochatScore: 12,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:4712,456114,173,571101,055,0002,334,0002,113,536
2May 20, 2026 05:4712,460114,486,474101,085,0002,340,0002,113,536
3May 20, 2026 05:4712,465113,812,607101,450,0002,010,0002,113,536
4May 20, 2026 05:4712,466115,140,106101,119,0002,351,0002,113,536
5May 20, 2026 05:4712,468113,977,921101,142,0002,346,0002,113,536
6May 20, 2026 05:4712,481113,961,538101,257,0002,343,0002,113,536
7May 20, 2026 05:4712,483115,306,527101,261,0002,351,0002,113,536
8May 20, 2026 05:4712,540113,478,626102,039,0002,046,0002,113,536
9May 20, 2026 05:4712,587115,172,745102,387,0002,091,0002,113,536