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 listFeb 21, 2026 21:57Mathaus Adorno PereiraMathaus Adorno PereiraScore: 280,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 21:57279,6012,346,381,3242,223,744,00096,945,0002,326,528
2Feb 21, 2026 21:57279,6952,346,335,6632,228,532,00092,938,0002,318,336
3Feb 21, 2026 21:57279,7292,351,124,8832,229,800,00091,950,0002,326,528
4Feb 21, 2026 21:57279,7572,352,368,9512,225,023,00096,957,0002,322,432
5Feb 21, 2026 21:57280,1082,359,852,7922,220,944,000103,950,0002,330,624
6Feb 21, 2026 21:57280,1312,347,566,1602,223,131,000101,960,0002,330,624
7Feb 21, 2026 21:57280,1862,355,408,8372,231,601,00093,941,0002,330,624
8Feb 21, 2026 21:57280,2652,353,283,9452,219,233,000106,963,0002,375,680
9Feb 21, 2026 21:57280,6772,362,566,1962,219,686,000109,934,0002,318,336