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 listMay 4, 2026 21:07M-RochatM-RochatScore: 32,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:0732,310285,248,449267,174,0001,004,0002,351,104
2May 4, 2026 21:0732,399287,018,886267,911,0001,004,0002,347,008
3May 4, 2026 21:0732,481287,757,534268,595,0001,004,0002,342,912
4May 4, 2026 21:0732,533288,660,787269,026,0001,004,0002,363,392
5May 4, 2026 21:0732,906288,438,488272,114,0001,011,0002,367,488
6May 4, 2026 21:0732,937293,457,021272,375,0001,006,0002,347,008
7May 4, 2026 21:0733,050292,741,882273,310,0001,008,0002,363,392
8May 4, 2026 21:0733,257292,673,513275,026,0001,008,0002,334,720
9May 4, 2026 21:0733,259295,440,299275,045,0001,007,0002,342,912