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 listSep 27, 2026 04:15mkmkScore: 53,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 04:1652,763448,850,324436,696,0001,242,0002,113,536
2Sep 27, 2026 04:1652,841449,151,009437,342,0001,241,0002,113,536
3Sep 27, 2026 04:1653,830458,663,694445,791,0001,002,0002,113,536
4Sep 27, 2026 04:1653,843458,048,477445,663,0001,241,0002,113,536
5Sep 27, 2026 04:1653,859458,813,474446,023,0001,008,0002,113,536
6Sep 27, 2026 04:1653,897458,525,975446,345,0001,001,0002,113,536
7Sep 27, 2026 04:1653,909457,901,183446,257,0001,191,0002,113,536
8Sep 27, 2026 04:1653,944458,966,151446,468,0001,273,0002,113,536
9Sep 27, 2026 04:1654,009458,832,604447,273,0001,004,0002,113,536