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 listSep 23, 2026 00:41Kevin HeaveyKevin HeaveyScore: 3,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 00:453,33036,501,08026,510,0001,136,0002,113,536
2Sep 23, 2026 00:453,34137,286,02026,663,0001,072,0002,113,536
3Sep 23, 2026 00:453,34237,270,56726,730,0001,015,0002,113,536
4Sep 23, 2026 00:453,34637,294,77726,758,0001,016,0002,113,536
5Sep 23, 2026 00:453,35136,496,66926,657,0001,159,0002,113,536
6Sep 23, 2026 00:453,35136,859,65626,798,0001,023,0002,113,536
7Sep 23, 2026 00:453,35937,386,94926,836,0001,044,0002,113,536
8Sep 23, 2026 00:453,36136,953,19526,826,0001,071,0002,113,536
9Sep 23, 2026 00:453,36137,421,31826,883,0001,021,0002,113,536