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 18, 2026 20:47lipapipalipapipaScore: 6,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:476,17272,930,43748,213,0003,013,0002,297,856
2Feb 18, 2026 20:476,25375,522,70248,903,0002,994,0002,334,720
3Feb 18, 2026 20:476,25474,012,77448,912,0002,994,0002,424,832
4Feb 18, 2026 20:476,25578,634,44448,925,0002,995,0002,506,752
5Feb 18, 2026 20:476,28574,098,37550,163,0002,006,0002,506,752
6Feb 18, 2026 20:476,29278,503,06349,209,0003,012,0002,326,528
7Feb 18, 2026 20:476,30078,619,79949,277,0003,017,0002,306,048
8Feb 18, 2026 20:476,31376,937,41250,385,0002,015,0002,330,624
9Feb 18, 2026 20:476,31578,852,80149,391,0003,023,0002,502,656
10Feb 18, 2026 20:476,31677,860,11949,401,0003,024,0002,428,928
11Feb 18, 2026 20:476,32483,755,22550,474,0002,018,0002,502,656
12Feb 18, 2026 20:476,53379,396,65251,212,0003,012,0002,437,120