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 18, 2026 15:37wnwnScore: 7,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:377,35887,404,58559,069,0002,002,0002,445,312
2Feb 18, 2026 15:377,36982,463,38659,158,0002,005,0002,441,216
3Feb 18, 2026 15:377,38188,079,18860,255,0001,004,0002,449,408
4Feb 18, 2026 15:377,43090,575,65060,662,0001,011,0002,441,216
5Feb 18, 2026 15:377,44790,924,69659,820,0001,994,0002,445,312
6Feb 18, 2026 15:377,48083,273,35960,086,0002,002,0002,277,376