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 21, 2026 02:49zielajzielajScore: 3,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 02:493,39049,304,10226,134,0002,010,0002,404,352
2Apr 21, 2026 02:493,43449,503,65927,490,0001,018,0002,445,312
3Apr 21, 2026 02:493,44152,393,75127,541,0001,020,0002,408,448
4Apr 21, 2026 02:493,44457,379,91127,569,0001,021,0002,400,256
5Apr 21, 2026 02:493,47454,130,00526,849,0001,988,0002,408,448
6Apr 21, 2026 02:493,49958,471,51527,042,0002,003,0002,400,256
7Apr 21, 2026 02:493,51340,476,90026,147,0003,016,0002,248,704
8Apr 21, 2026 02:493,52740,437,79927,261,0002,019,0002,252,800
9Apr 21, 2026 02:493,53850,426,95727,342,0002,025,0002,404,352