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 10, 2026 00:57Josu San MartinJosu San MartinScore: 5,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 00:585,05358,078,12940,857,0001,086,0002,486,272
2May 10, 2026 00:585,15958,337,73241,738,0001,086,0002,482,176
3May 10, 2026 00:585,22259,889,07342,256,0001,094,0002,502,656
4May 10, 2026 00:585,24658,813,72542,444,0001,102,0002,498,560
5May 10, 2026 00:585,24863,477,16742,463,0001,101,0002,494,464
6May 10, 2026 00:585,25159,310,15742,488,0001,098,0002,494,464
7May 10, 2026 00:585,26958,412,82942,645,0001,089,0002,502,656
8May 10, 2026 00:585,31661,474,21743,076,0001,053,0002,506,752
9May 10, 2026 00:585,42463,845,14143,892,0001,135,0002,490,368