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 3, 2026 09:50RuszrokRuszrokScore: 437,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 09:50437,4623,655,204,7483,396,068,000234,866,0002,289,664
2Feb 3, 2026 09:50437,6453,661,170,8143,397,621,000234,835,0002,285,568
3Feb 3, 2026 09:50437,6913,663,931,3323,397,978,000234,860,0002,285,568
4Feb 3, 2026 09:50437,7593,659,339,4133,398,503,000234,896,0002,277,376
5Feb 3, 2026 09:50437,7653,661,922,7673,398,614,000234,835,0002,277,376
6Feb 3, 2026 09:50437,9043,669,912,4213,397,762,000236,844,0002,285,568
7Feb 3, 2026 09:50437,9313,658,736,5463,398,972,000235,859,0002,285,568
8Feb 3, 2026 09:50437,9773,664,152,0503,397,326,000237,882,0002,498,560
9Feb 3, 2026 09:50438,2003,664,982,6863,399,184,000237,872,0002,293,760