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 listApr 24, 2026 08:08Dominique GarmierDominique GarmierScore: 6,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:096,78574,207,64654,309,0002,011,0002,351,104
2Apr 24, 2026 08:096,87573,496,28154,062,0003,003,0002,412,544
3Apr 24, 2026 08:096,87777,524,08855,084,0002,003,0002,347,008
4Apr 24, 2026 08:096,88572,777,86554,140,0003,007,0002,347,008
5Apr 24, 2026 08:096,90373,002,63155,288,0002,010,0002,351,104
6Apr 24, 2026 08:096,90574,114,81154,298,0003,016,0002,347,008
7Apr 24, 2026 08:096,93177,269,77955,512,0002,018,0002,355,200
8Apr 24, 2026 08:096,94079,454,38055,583,0002,021,0002,334,720
9Apr 24, 2026 08:096,97474,100,62754,892,0002,994,0002,351,104