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 listAug 1, 2026 18:46TonyTonyScore: 87,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 18:4687,066733,561,092663,401,00059,253,0002,113,536
2Aug 1, 2026 18:4687,076733,647,830663,430,00059,301,0002,113,536
3Aug 1, 2026 18:4687,094733,811,725663,398,00059,488,0002,113,536
4Aug 1, 2026 18:4687,114733,991,546663,381,00059,668,0002,113,536
5Aug 1, 2026 18:4687,182745,243,113663,624,00059,989,0002,113,536
6Aug 1, 2026 18:4687,294747,010,447664,359,00060,189,0002,113,536
7Aug 1, 2026 18:4687,326747,620,774664,433,00060,374,0002,113,536
8Aug 1, 2026 18:4687,335747,776,241663,997,00060,884,0002,113,536
9Aug 1, 2026 18:4687,706752,537,991665,197,00062,768,0002,113,536