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 listJan 15, 2026 16:41Jonathan GopelJonathan GopelScore: 363,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 16:41361,6003,030,331,5822,942,316,00058,966,0002,359,296
2Jan 15, 2026 16:41361,7493,030,604,2082,932,551,00069,965,0002,281,472
3Jan 15, 2026 16:41361,7773,030,256,5732,939,774,00062,973,0002,281,472
4Jan 15, 2026 16:41362,4353,035,595,1112,937,253,00070,957,0002,359,296
5Jan 15, 2026 16:41363,8993,053,453,3382,952,395,00067,963,0002,281,472
6Jan 15, 2026 16:41364,4263,056,350,4532,960,760,00063,973,0002,281,472
7Jan 15, 2026 16:41364,7213,055,658,6492,949,233,00077,953,0002,359,296
8Jan 15, 2026 16:41365,1653,060,412,8532,962,872,00067,997,0002,281,472
9Jan 15, 2026 16:41395,3603,308,932,3493,226,513,00054,974,0002,281,472